A note on permutation polynomials and finite geometries
نویسنده
چکیده
Let F be a finite field of odd cardinality. A polynomial g in F[x] is called a permutation polynomial if g defines a bijective function on F. We will call a polynomial f in F[x] a difference permutation polynomial if f(x + a) -f(x) is a permutation polynomial for every nonzero a in F. Difference permutation polynomials are a special case of planar functions, as defined by Dembowski [2, p. 2271, and give rise to affine planes. Quadratic polynomials are clearly difference permutation polynomials, and give rise to desarguesian planes. For F a prime field, J.F. Dillon (private communication) has asked whether there are any nonquadratic difference permutation polynomials over F. Such polynomials would give rise to nondesarguesian planes. An analogous question for arbitrary fields of odd cardinality is brought up in [3, p. 2571. In this note we show that every difference permutation polynomial over GF(p) is quadratic. The idea of the proof is roughly as follows. First we show that the graph of a difference permutation polynomial f is closely related to a (p + l)-arc K in the desarguesian projective plane over GF(p). Then Segre’s theorem says that K is a conic. This implies that f is a quadratic polynomial. I have been informed that the result of this paper has been independently obtained by Y. Hiramine. His proof is different from mine and was submitted for publication at about the same time.
منابع مشابه
A note on constructing permutation polynomials
Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for constructing permutation polynomials over the field using a bijective map from H to a coset of H. A similar, but inequivalent, method for lifting permutation behaviour of a polynomial to an extension field is also given.
متن کاملPermutations in a Finite Field
For q = 5, this was proved to be true by Betti; for q = 7 the corresponding result was verified by Dickson [l, p. 119]. In this note we show very simply that this result holds for all q. Since the totality of permutation polynomials evidently furnishes a representation of the symmetric group on q letters, it will suffice to show that every transposition (Oa) can be generated by means of the spe...
متن کاملA Note on the Constructions of Orthomorphic Permutations
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over F 2 , and it is verified that the number of all orthomorphic permutations over F 4 2 is 244,744,192. With the theory of finite fields, a brief method is derived to generate a permutation polynomial corresponding to every permutatio...
متن کاملSome new results on permutation polynomials over finite fields
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-...
متن کاملRédei polynomials over fields of characteristic zero
The possible role of Rédei polynomials over fields of characteristic zero in the quest for solutions to problems in the study of geometries and vector spaces over finite fields is discussed. This note is exploratory and does not attempt to solve any particular problem, although an example problem is considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 80 شماره
صفحات -
تاریخ انتشار 1990